Data-Driven Computational Homogenization Method Based on Euclidean Bipartite Matching
نویسندگان
چکیده
منابع مشابه
The quadratic stochastic Euclidean bipartite matching problem
We propose a new approach for the study of the quadratic stochastic Euclidean bipartite matching problem between two sets of N points each, N 1. The points are supposed independently randomly generated on a domain Ω ⊂ Rd with a given distribution ρ(x) on Ω. In particular, we derive a general expression for the correlation function and for the average optimal cost of the optimal matching. A prev...
متن کاملA Scaling Hypothesis for the Euclidean Bipartite Matching Problem
We propose a simple yet very predictive form, based on a Poisson's equation, for the functional dependence of the cost from the density of points in the Euclidean bipartite matching problem. This leads, for quadratic costs, to the analytic prediction of the large N limit of the average cost in dimension d = 1,2 and of the subleading correction in higher dimension. A nontrivial scaling exponent,...
متن کاملA novel method for detecting structural damage based on data-driven and similarity-based techniques under environmental and operational changes
The applications of time series modeling and statistical similarity methods to structural health monitoring (SHM) provide promising and capable approaches to structural damage detection. The main aim of this article is to propose an efficient univariate similarity method named as Kullback similarity (KS) for identifying the location of damage and estimating the level of damage severity. An impr...
متن کاملOn the optimality of the window method in computational homogenization
The window method, where the microstructural sample is embedded into a frame of a homogeneous material, offers an alternative to classical boundary conditions in computational homogenization. Experience with the window method, which is essentially the selfconsistent scheme but with a finite surrounding medium instead of an infinite one, indicates that it delivers faster convergence of the macro...
متن کاملSparse Data Structures for Weighted Bipartite Matching
Inspired by the success of blocking to improve the performance of algorithms for sparse matrix vector multiplication [5] and sparse direct factorization [1], we explore the benefits of blocking in related sparse graph algorithms. A natural question is whether the benefits of local blocking extend to other sparse graph algorithms. Here we examine algorithms for finding a maximum-weight complete ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Engineering Mechanics
سال: 2020
ISSN: 0733-9399,1943-7889
DOI: 10.1061/(asce)em.1943-7889.0001708